Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
601	Containment of Data Graph Queries Egor V. Kostylev Juan L. Reutter University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2013-11-07 07:11:59 Computational complexity theory Graph Connectivity FO Reachability Tree Theoretical computer science Mathematics Graph theory
602	NEW from Edward Elgar Publishing Complexity, Institutions and Public Policy Agile Decision-making in a Turbulent World Graham Room, University of Bath, UK Add to Reading List Source URL: people.bath.ac.uk Language: English - Date: 2012-02-21 14:05:04 Nature Complex systems theory Edward Elgar Publishing Complexity Social dynamics Complex systems Systems Science Structure
603	The Complexity of Flow Analysis in Higher-Order Languages David Van Horn The Complexity of Flow Analysis in Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2009-08-14 14:13:52 Models of computation Notation Programming language Lambda calculus Control flow analysis Algorithm International Conference on Functional Programming Functional programming Computational complexity theory Theoretical computer science Applied mathematics Computer science
604	Advanced Algorithms 2012A – Problem Set 4 Robert Krauthgamer December 23, Prove that the number of connected components in a graph G is equal to the multiplicity of 0 among the eigenvalues of LG (the Laplacian Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English Analysis of algorithms Algebraic graph theory Conductance Matrices Probability theory Cheeger constant Isoperimetric inequality Algorithm Time complexity Mathematics Graph theory Theoretical computer science
605	Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-05-17 00:53:00 Quantum complexity theory Probabilistic complexity theory Models of computation Analysis of algorithms Randomized algorithm PP Decision tree model IP MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
606	Abstract: One of the main goals of bounded rationality models is to understand the limitations of agent’s abilities in building representations of strategic situations as maximization problems and in solving these pr Add to Reading List Source URL: ogossner.free.fr Language: English - Date: 2005-10-17 11:51:33 Turing machine Computability theory Models of computation Alan Turing Computational complexity theory Algorithm NP PP Computability Theoretical computer science Applied mathematics Computer science
607	Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries Marcelo Arenas Pablo Barceló Add to Reading List Source URL: web.ing.puc.cl Language: English - Date: 2013-12-24 11:08:56 Applied mathematics Datalog Data integration FO Data Inequality Computational complexity theory Algorithm MAX-3SAT Conjunctive query Database theory Mathematics
608	Hardness Preserving Reductions via Cuckoo Hashing Itay Berman∗ Iftach Haitner∗ Ilan Komargodski† Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2013-06-11 04:11:57 Applied mathematics Search algorithms Hashing Computational complexity theory Pseudorandom function family Pseudorandom generator Hash function Cuckoo hashing One-way function Theoretical computer science Mathematics Pseudorandomness
609	2013 IEEE Symposium on Security and Privacy Circuit Structures for Improving Efﬁciency of Security and Privacy Tools Samee Zahur and David Evans University of Virginia [samee, evans]@virginia.edu Add to Reading List Source URL: www.ieee-security.org Language: English - Date: 2013-04-05 19:56:51 Abstract data types Electronic engineering Stack Computational complexity theory Circuit Electronic circuit Secure multi-party computation Boolean circuit Lookup table Computing Theoretical computer science Electronics
610	arXiv:1209.5993v4 [cs.CC] 11 SepGeometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma Dedicated to Sri Ra Add to Reading List Source URL: gct.cs.uchicago.edu Language: English - Date: 2013-11-07 17:14:04 Analysis of algorithms Invariant theory Probabilistic complexity theory Randomized algorithm Time complexity Emmy Noether SC Polynomial Circuit complexity Theoretical computer science Computational complexity theory Mathematics

UPDATE